Probabilistic pairwise sequence alignment

نویسنده

  • Lawren Smithline
چکیده

We describe an new algorithm for visualizing an alignment of biological sequences according to a probabilistic model of evolution. The resulting data array is readily interpreted by the human eye and amenable to digital image techniques. We present examples using mRNA sequences from mouse and rat: three cytochromes and two zinc finger proteins. The underlying evolutionary model is derived from one proposed by Thorne, Kishino, and Felsenstein and improved by Hein and others. The demonstration implementation aligns two sequences using time and memory quadratic in the mean sequence length. The algorithm is extensible, after Lunter, Miklós, Song and Hein to multiple sequences. We mention a basic method to reduce time and memory demands.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

gpALIGNER: A Fast Algorithm for Global Pairwise Alignment of DNA Sequences

Bioinformatics, through the sequencing of the full genomes for many species, is increasingly relying on efficient global alignment tools exhibiting both high sensitivity and specificity. Many computational algorithms have been applied for solving the sequence alignment problem. Dynamic programming, statistical methods, approximation and heuristic algorithms are the most common methods appli...

متن کامل

PROBCONS: Probabilistic Consistency-Based Multiple Alignment of Amino Acid Sequences

Obtaining an accurate multiple alignment of protein sequences is a difficult computational problem for which many heuristic techniques sacrifice optimality to achieve reasonable running times. The most commonly used heuristic is progressive alignment, which merges sequences into a multiple alignment by pairwise comparisons along the nodes of a guide tree. To improve accuracy, consistency-based ...

متن کامل

A hidden Markov model for progressive multiple alignment

MOTIVATION Progressive algorithms are widely used heuristics for the production of alignments among multiple nucleic-acid or protein sequences. Probabilistic approaches providing measures of global and/or local reliability of individual solutions would constitute valuable developments. RESULTS We present here a new method for multiple sequence alignment that combines an HMM approach, a progre...

متن کامل

A Method of Multiple Protein Sequence Alignment Using a Hybrid Approach

Multiple protein sequence alignment is an extension of pairwise alignment to incorporate more than two sequences at a time. Multiple protein sequence alignment methods try to align all of the sequences in a given query set. Multiple protein sequence alignments are often used in identifying conserved sequence regions across a group of sequences hypothesized to be evolutionarily related. Many app...

متن کامل

PSAR: measuring multiple sequence alignment reliability by probabilistic sampling

Multiple sequence alignment, which is of fundamental importance for comparative genomics, is a difficult problem and error-prone. Therefore, it is essential to measure the reliability of the alignments and incorporate it into downstream analyses. We propose a new probabilistic sampling-based alignment reliability (PSAR) score. Instead of relying on heuristic assumptions, such as the correlation...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004